Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
901	Integrated simultaneous analysis of different biomedical data types with exact weighted bi-cluster editing Peng Sun, Jan Baumbach, Jiong Guo Computational Systems Biology Group Max Planck Institute for Informatics, Clust Add to Reading List Source URL: www.cls.zju.edu.cn Language: English - Date: 2013-06-17 21:43:16 Analysis of algorithms Parameterized complexity Kernelization Clique Graph Theoretical computer science Graph theory Mathematics
902	Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗ Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2014-04-01 09:13:02 Complexity classes Circuit complexity Boolean algebra NP-complete problems Time complexity ACC0 Cook–Levin theorem P NC Theoretical computer science Computational complexity theory Applied mathematics
903	Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan Add to Reading List Source URL: www.jair.org Language: English - Date: 2015-01-30 21:27:29 Constraint programming Constraint satisfaction problem Constraint satisfaction Exponential time hypothesis Boolean satisfiability problem NP-complete Tree decomposition Conjunctive normal form Time complexity Theoretical computer science Applied mathematics Computational complexity theory
904	A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-04-02 14:14:13 Circuit complexity Computational complexity theory ACC0 FO Comparator Sorting network AC TC0 Boolean circuit Theoretical computer science Applied mathematics Complexity classes
905	Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds∗ Yuval Filmus University of Toronto Massimo Lauria Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2013-05-06 19:14:13 Computational complexity theory Conjunctive normal form Proof complexity PP IP Polynomial Boolean algebra Frege system MAX-3SAT Theoretical computer science Applied mathematics Logic in computer science
906	The Mathematics of Algorithm Design about all these algorithms without recourse to specific computing devices or computer programming languages, instead expressing them using the language of mathematics. In fact, the not Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-14 23:00:29 Complexity classes Mathematical optimization NP-complete problems Operations research Travelling salesman problem Algorithm Minimum spanning tree Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
907	Multi-processor Scheduling to Minimize Flow Time with Resource Augmentation Chandra Chekuri Ashish Goel ∗ Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2005-08-24 06:29:40 Analysis of algorithms Computational complexity theory Probabilistic complexity theory Randomized algorithm Algorithm Big O notation Job shop scheduling David Shmoys Theoretical computer science Applied mathematics Mathematics
908	On the Computational Complexity of Optimal Sorting Network Verification Ian Parberry∗ Department of Computer Science The Pennsylvania State University Add to Reading List Source URL: larc.unt.edu Language: English - Date: 2011-05-12 16:09:32 Comparator Structure Electronics Bitonic sorter Pairwise sorting network Sorting algorithms Sorting network Mathematics
909	MLRG: Bayes. Net. Complexity Kui Tang Background Definitions Add to Reading List Source URL: kui-tang.com Language: English Complexity classes Bayesian statistics Graphical models Statistical models Bayesian network NP P-complete Belief propagation Reduction Theoretical computer science Computational complexity theory Applied mathematics
910	UNIVERSITY OF CALIFORNIA, RIVERSIDE DEPARTMENT OF COMPUTER SCIENCE 2006 DEPTH EXAMINATION IN THEORY OF OF COMPUTATION AND ALGORITHMS • There are 10 problems on the test. Each problem is worth 10 points. The ordering o Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2007-02-09 21:58:07 NP Time complexity P FL FO Turing machine Computational complexity theory Theoretical computer science Applied mathematics Complexity classes

UPDATE